Perturbation Bounds for Hyperbolic Matrix Factorizations

نویسنده

  • Michael Berhanu
چکیده

Several matrix factorizations depend on orthogonal factors, matrices that preserve the Euclidean scalar product. Some of these factorizations can be extended and generalized to (J, J̃)-orthogonal factors, that is, matrices that satisfy H JH = J̃ , where J and J̃ are diagonal with diagonal elements ±1. The purpose of this work is to analyze the perturbation of matrix factorizations that have a (J, J̃)-orthogonal or orthogonal factor and to give first order perturbation bounds. For each factorization analyzed, we give the sharpest possible first order bound, which yields a condition number. The cost of computing these condition numbers is high. It is usually equivalent to computing the 2-norm of an n2×n2 matrix for a problem of size n. Thus, we also propose less sharp bounds that are less expensive to compute.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perturbation Theory for Factorizations of LU Type through Series Expansions

Componentand normwise perturbation bounds for the block LU factorization and block LDL∗ factorization of Hermitian matrices are presented. We also obtain, as a consequence, perturbation bounds for the usual pointwise LU, LDL∗, and Cholesky factorizations. Some of these latter bounds are already known, but others improve previous results. All the bounds presented are easily proved by using serie...

متن کامل

Rigorous Perturbation Bounds of Some Matrix Factorizations

This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The considered componentwise perturbations have the form of backward rounding errors for the standard factorization algorithms. The used approach is a combination of the classic and refined matrix equation approaches. Each of th...

متن کامل

Rigorous Multiplicative Perturbation Bounds for the Generalized Cholesky Factorization and the Cholesky–like Factorization

The generalized Cholesky factorization and the Cholesky-like factorization are two generalizations of the classic Cholesky factorization. In this paper, the rigorous multiplicative perturbation bounds for the two factorizations are derived using the matrix equation and the refined matrix equation approaches. The corresponding first-order multiplicative perturbation bounds, as special cases, are...

متن کامل

Perturbation bounds for $g$-inverses with respect to the unitarily invariant norm

Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...

متن کامل

Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices

We call a matrix triadic if it has no more than two nonzero off-diagonal elements in any column. A symmetric tridiagonal matrix is a special case. In this paper we consider LXLT factorizations of symmetric triadic matrices, where L is unit lower triangular and X is diagonal, block diagonal with 1×1 and 2×2 blocks, or the identity with L lower triangular. We prove that with diagonal pivoting, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005